Using Keywords to Find the Right Path through Relational Data

Keyword search is emerging as the standard way to access information of any kind. Following this trend, several approaches to keyword search over relational databases have been proposed recently. Most of them build tree-shaped solutions that connect tuples matching the given keywords. In this paper, we propose a novel technique to this problem that generates solutions by simply combining joining paths. In this way, the complexity of the process is reduced and the query engine of the underlying RDBMS can be fully exploited. Several experiments show a very good behavior with respect to other approaches in terms of both effectiveness and efficiency.